Closure properties of deterministic indexed languages
نویسندگان
چکیده
منابع مشابه
Closure Properties of Ordered Languages
In this note, we solve questions regarding closure properties of ordered languages. Especially, ordered languages form a full abstract family of recursive languages which is neither intersection-nor complementation-closed.
متن کاملClosure Properties of Minimalist Derivation Tree Languages
Recently, the question has been raised whether the derivation tree languages of Minimalist grammars (MGs; [14, 16]) are closed under intersection with regular tree languages [4, 5]. Using a variation of a proof technique devised by Thatcher [17], I show that even though closure under intersection does not obtain, it holds for every MG and regular tree language that their intersection is identic...
متن کاملClosure properties of locally finite omega-languages
Locally finite ω-languages, defined via second order quantifications followed by a first order locally finite sentence, were introduced by Ressayre in [Res88]. They enjoy very nice properties and extend ω-languages accepted by finite automata or defined by monadic second order sentences. We study here closure properties of the family LOCω of locally finite omega languages. In particular we show...
متن کاملDeterministic Fuzzy Automaton on Subclasses of Fuzzy Regular ω-Languages
In formal language theory, we are mainly interested in the natural language computational aspects of ω-languages. Therefore in this respect it is convenient to consider fuzzy ω-languages. In this paper, we introduce two subclasses of fuzzy regular ω-languages called fuzzy n-local ω-languages and Buchi fuzzy n-local ω-languages, and give some closure properties for those subclasses. We define a ...
متن کاملDownward Closures of Indexed Languages
ions. A fruitful idea in the analysis of complex systems is that of abstractions: Instead of working with the original model, one considers a model that has a simpler structure but preserves pertinent properties. A prominent example of such an abstraction is the Parikh image, which is available whenever the semantics of a model is given as a formal language. If L is a language over an alphabet ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Control
سال: 1980
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90766-4